Minimal Belief and Negation as Failure: A Feasible Approach
نویسندگان
چکیده
Lifschitz introduced a logic of minimal belief and negation as failure, called MBNF, in order to provide a theory of epistemic queries to nonmonotonic databases. We present a feasible subsystem of MBNF which can be translated into a logic built on first order logic and negation as failure, called FONF. We give a semantics for FONF along with an extended connection calculus. In particular, we demonstrate that the obtained system is still more expressive than other approaches.
منابع مشابه
Reasoning about Minimal Belief and Negation as Failure
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...
متن کاملReasoning with Minimal Belief and Negation as Failure: Algorithms and Complexity
We study the computational properties of the propositional fragment of MBNF , the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries and logic programming. We characterize the complexity and provide algorithms...
متن کاملReasoning about Minimal Belief and Negation as
We investigate the problem of reasoning in the propositional fragment of MBNF, the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms, including default logic, autoepistemic logic, circumscription, epistemic queries, and logic programming. We characterize the complexity and provide algorith...
متن کاملMinimal Belief and Negation as Failure
Fangzhen Lin and Yoav Shoham deened a propositional nonmonotonic logic which uses two independent modal operators. One of them represents minimal knowledge, the other is related to the ideas of justiication (as understood in default logic) and of negation as failure. We describe a simpliied version of that system, show how quantiiers can be included in it, and study its relation to circumscript...
متن کاملOn the Complexity of Reasoning with Negation as Failure
In this work we study the computational properties of the propositional fragment of MBNF , the logic of minimal belief and negation as failure introduced by Lifschitz, which can be considered as a unifying framework for several nonmonotonic formalisms. In particular, the logic MBNF has been used in order to give a declarative semantics to very general classes of logic programs with negation. We...
متن کامل